#if 1
#include<iostream>
#include"AvlTree.h"
#include"AvlTree.cpp"

using namespace std;



int main()
{
	int arr[] = { 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12 };
	int arr1[] = { 53, 78, 17, 65, 45, 9, 87, 23, 81, 94, 88 };
	int len = sizeof(arr) / sizeof(arr[0]);

	AvlTree<int> avl;
	for (int i = 0; i < len; i++)
	{
		avl.Insert(arr[i]);
		if (avl.Is_BSTTree(avl.GetHead()->parent)) cout << " is BSTTree ";
		else cout << " is not BSTTree ";

		if (avl.Is_AVLTree(avl.GetHead()->parent)) cout << "is AVLTree" << endl;
		else cout << "is not AVLTree" << endl;
	}

	cout << "avltree size : " << avl.GetSize() << endl;
	avl.InOrder();
	avl.NoRecInOrder();
	avl.MirrorNoRecInOrder();

	AvlNode<int>* avlnode = avl.FindValue(81);
	cout << "FindValue : " << avlnode->key << endl;

	avlnode = avl.NoRecFindValue(87);
	cout << "NoRecFindValue : " << avlnode->key << endl;

	system("pause");
	return 0;
}
#endif